Inductive and Coinductive Data Types in Typed Lambda Calculus Revisited Herman Geuvers Radboud University Nijmegen and Eindhoven University of Technology

Source URL: www.cs.ru.nl

• Type theory
• Computability theory
• Functional programming
• Theoretical computer science
• Recursion
• Initial algebra
• Lambda calculus
• Primitive recursive function
• Inductive type
• Catamorphism
• F-algebra

A Theory of Indirection via Approximation Aquinas Hobor ∗† Robert Dockins† Andrew W. Appel †

Source URL: www.cs.princeton.edu

• Mathematical logic
• Software engineering
• Logic
• Formal languages
• Computability theory
• Models of computation
• Lambda calculus
• Formal methods
• Interpretation
• Syntactic predicate
• System F
• Monad

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Source URL: www.scottaaronson.com

• Theory of computation
• Computability theory
• Busy beaver
• Computable function
• Computability
• Turing machine
• Halting problem
• Hypercomputation
• Computable number
• Algorithm
• Alan Turing
• Ackermann function

Logical Methods in Computer Science Volume 00, Number 0, Pages 000–000 SXX λ -RBAC: PROGRAMMING WITH ROLE-BASED ACCESS CONTROL RADHA JAGADEESAN, ALAN JEFFREY, CORIN PITCHER, AND JAMES RIELY

Source URL: ect.bell-labs.com

• Type theory
• Algebraic geometry
• Computability theory
• Lambda calculus
• Theoretical computer science
• Role-based access control
• Valuation
• Subtyping
• Monad
• CurryHoward correspondence

Revisiting automatic semigroups - change of generators Erzsi Dombi Univerity of Strathclyde December 03, 2013

Source URL: www-users.york.ac.uk

• Algebra
• Abstract algebra
• Mathematics
• Semigroup theory
• Algebraic structures
• Computability theory
• Combinatorics on words
• Category theory
• Automatic semigroup
• Semigroup
• Special classes of semigroups
• Free monoid

Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus Andrew D. Gordon1 and Alan Jeffrey2? 1 2

Source URL: ect.bell-labs.com

• Computability theory
• Lambda calculus
• Theoretical computer science
• Regression analysis
• Computer science
• Mathematics
• Classical cipher

Testing Polymorphic Properties Jean-Philippe Bernardy, Patrik Jansson, and Koen Claessen Chalmers University of Technology {bernardy,patrikj,koen}@chalmers.se Abstract. This paper is concerned with testing properties of

Source URL: publications.lib.chalmers.se

• Software engineering
• Declarative programming
• Mathematics
• Type theory
• Functional programming
• Functions and mappings
• Polymorphism
• Computability theory
• Parametricity
• Auxiliary function
• Currying
• Functor

Computing with functionals - computability theory or computer science? Dag Normann ∗

Source URL: folk.uio.no

A CPS-like Transformation of Continuation Marks Kimball R. Germane A thesis submitted to the faculty of Brigham Young University

Source URL: jeapostrophe.github.io

• Control flow
• Subroutines
• Computability theory
• Theoretical computer science
• Functional programming
• Continuation-passing style
• Lambda calculus
• Continuation
• Direct style
• Eval
• Stack
• Static single assignment form

Temporal Higher-Order Contracts Tim Disney Cormac Flanagan Jay McCarthy

Source URL: jeapostrophe.github.io

• Lambda calculus
• Combinatory logic
• Logic in computer science
• Computability theory
• Functions and mappings
• Formal methods
• Monad
• Derivative
• Trace